PAIRWISE BALANCED, SEMI-REGULAR AND REGULAR GROUP DIVISIBLE DESIGNS
نویسندگان
چکیده
منابع مشابه
2-Walk-Regular Dihedrants from Group-Divisible Designs
In this note, we construct bipartite 2-walk-regular graphs with exactly 6 distinct eigenvalues as the point-block incidence graphs of group divisible designs with the dual property. For many of them, we show that they are 2-arc-transitive dihedrants. We note that some of these graphs are not described in Du et al. (2008), in which they classified the connected 2-arc transitive dihedrants.
متن کاملE-optimal Semi-regular Graph Designs and Partially Efficiency Balanced Designs
Jacroux (1985) extended the definition of Regular graph designs of Mitchell and John (1976) to Semi-regular graph (SRG) designs, and studied the type 1 optimality of block designs. Here, the construction and optimality of some more SRG designs are discussed. Moreover, in this investigation, it is established that a class of two associate partially efficiency balanced design is, in fact SRG desi...
متن کاملA Note on New Semi-Regular Divisible Difference Sets
We give a C0051JUCtion for new families of semi-regular divisible difference sets. The construction iJ a variation of McFarland's scheme [Sl tor nonc;yclic difference SCIS. • Let G be a group of order 11111 and N a subgroup of G of order n. If D is a k-subset of G then Dis a {m, n, le , >.1, >.2) divisible difference set in G relative to N provided that the differences dd'1 fur d, d ' ED, d ;e ...
متن کاملSome Pairwise Balanced Designs
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, and with every pair of points occurring in a unique block; for a fixed K, B(K) is the set of all v for which a B(K; v) exists. A set, S, is a PBD-basis for the set, T , if T = B(S). Let Na(m) = {n : n ≡ a mod m}, and N≥m = {n : n ≥ m}; with Q the corresponding restriction of N to prime powers. Thi...
متن کاملWalk-regular divisible design graphs
A divisible design graph (DDG for short) is a graph whose adjacency matrix is the incidence matrix of a divisible design. DDGs were introduced by Kharaghani, Meulenberg and the second author as a generalization of (v, k, λ)-graphs. It turns out that most (but not all) of the known examples of DDGs are walk-regular. In this paper we present an easy criterion for this to happen. In several cases ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of informatics and cybernetics
سال: 1986
ISSN: 0286-522X
DOI: 10.5109/13376